Some Results for Exact Support Recovery of Block Joint Sparse Matrix via Block Multiple Measurement Vectors Algorithm
نویسندگان
چکیده
Block multiple measurement vectors (BMMV) is a reconstruction algorithm that can be used to recover the support of block K-joint sparse matrix X from Y = ΨX + V. In this paper, we propose sufficient condition for accurate recovery via BMMV in noisy case. Furthermore, show optimality proposed absence noise when problem reduces single vector
منابع مشابه
Exploiting Correlation in Sparse Signal Recovery Problems: Multiple Measurement Vectors, Block Sparsity, and Time-Varying Sparsity
A trend in compressed sensing (CS) is to exploit structure for improved reconstruction performance. In the basic CS model (i.e. the single measurement vector model), exploiting the clustering structure among nonzero elements in the solution vector has drawn much attention, and many algorithms have been proposed such as group Lasso (Yuan & Lin, 2006). However, few algorithms explicitly consider ...
متن کاملSparse Randomized Kaczmarz for Support Recovery of Jointly Sparse Corrupted Multiple Measurement Vectors
While single measurement vector (SMV) models have been widely studied in signal processing, there is a surging interest in addressing the multiple measurement vectors (MMV) problem. In the MMV setting, more than one measurement vector is available and the multiple signals to be recovered share some commonalities such as a common support. Applications in which MMV is a naturally occurring phenom...
متن کاملSome results on the block numerical range
The main results of this paper are generalizations of classical results from the numerical range to the block numerical range. A different and simpler proof for the Perron-Frobenius theory on the block numerical range of an irreducible nonnegative matrix is given. In addition, the Wielandt's lemma and the Ky Fan's theorem on the block numerical range are extended.
متن کاملCompressed sensing of block-sparse positive vectors
In this paper we revisit one of the classical problems of compressed sensing. Namely, we consider linear under-determined systems with sparse solutions. A substantial success in mathematical characterization of an l1 optimization technique typically used for solving such systems has been achieved during the last decade. Seminal works [4, 18] showed that the l1 can recover a so-called linear spa...
متن کاملSparse Matrix Block-Cyclic Redistribution
Run-time support for the CYCLIC(k) redistribution on the SPMD computation model is presently very relevant for the scientific community. This work is focused to the characterization of the sparse matrix redistribution and its associate problematic due to the use of compressed representations. Two main improvements about the buffering and the coordinates calculation modify the original algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Physics
سال: 2023
ISSN: ['2327-4379', '2327-4352']
DOI: https://doi.org/10.4236/jamp.2023.114072